complexity graph
英 [kəmˈpleksəti ɡræf]
美 [kəmˈpleksəti ɡræf]
【计】复杂性图形
双语例句
- Then, based on the complexity of the color-match requirements, a new coloring graph structure is presented.
接着，针对颜色匹配的复杂情况，提出新的着色图构造。 - Electromagnetic Environment Complexity Metrics Algorithm Based on Directed Graph
基于有向图的电磁环境复杂度度量算法 - Analysis on Complexity of Graph Isomorphism Problem
关于图同构复杂性的分析 - A Supplement of the Complexity of Graph Isomorphism Test
关于图同构复杂性的一点补充 - In this paper, the existing analysis methods of software testability are classified roughly as analysis based on software complexity, analysis based on information theory, analysis based on PIE technology and analysis based on UML class graph.
本文对现有软件可测试性分析方法进行归类，将已有技术大致归并为基于复杂度分析、基于信息论分析、基于PIE技术分析和基于UML类图分析四种基本类型。 - Research on Object-Oriented Software Complexity Metrics Based on Inheritance Graph
基于继承图的面向对象软件复杂性度量研究 - The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).
后者的计算时间复杂性远远低于2N（N为图的顶点数），已接近于多项式时间复杂性。 - In order to degrade complexity of Connectivity Graph, work components are determined.
为降低装配体拓扑联接图的复杂度，对作业组件做出识别。 - In this paper. a new heuristic search algorithm is presented. It is able to improve the heuristic function during the searching and it has an O ( N) worst-case complexity ( N is the size of the graph searched).
本文提出一个新的启发式搜索算法，它可以在搜索过程中不断改善启发函数h，使最坏复杂度降为O（N）（N是被搜索图的大小）。 - This paper presents a graph-based uniform representation for composite graphic objects with different complexity, which, concerts them respectively into Spatial Relation Graph ( SRGs) in different information granularity.
本文对具有不同复杂性的复杂图形对象提出一个基于图形的统一表示法，文中根据不同信息粒度将复杂图形分别转化为空间关系图（SRG）。 - In order to depress complexity of the searching process, a method to simplify assembly liaison graph as well as recognition of subassembly is also proposed.
为降低算法的复杂性，本文提出了模糊简化配合关联图的建立方法以及子装配体的识别方法。 - Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
考虑到算法映射问题的NP复杂度和求解时间的指数性增加，本文主要研究两步规划方法，即先进行数据流图的最优规划，然后进行处理器的映射。 - Based on this, the paper gives the algorithm for judging strict conflict free and β acyclic decomposition in mixed environment, then shows that the complexity of the algorithm is linear using an example based on line graph.
据此，给出了判断严格无冲突及混合环境下无β环分解算法，并分析了算法时间的复杂度是线性的.最后，给出基于线图的实例验证。 - Because there existed high time complexity in AND/ OR graph search algorithms, it had to reduce the size of problem searching space to improve the practicability of the method.
由于与或图搜索算法具有很高的时间复杂度，因此必须降低问题搜索空间的规模，以提高方法的实用性。 - For the dynamic CDG matching, we first transform the CDG into the disordered label trees, and then design a matching algorithm with linear time complexity for the label tree based on the idea of breadth first search graph algorithm.
动态组件依赖图先被转化成无序标签树，然后借鉴图的宽度优先遍历方法，设计了一种线性时间复杂度的匹配算法。 - But its comprehensive structure of design doom the complexity of GEF application, and there a large amount of concepts in GEF framework and the class names and interface names are similar, handling way of graph editor is especially intricate.
但是它的综合的设计结构决定了GEF应用的复杂性，其中的概念繁多并且所提供的类、接口名称相似，特别是GEF处理图形编辑的方式较为复杂。 - Thirdly, an algorithm complexity analysis was made to prove that the parallel attack graph generation algorithm could highly improve the attack graph generation efficiency and reduce the attack graph complexity.
算法复杂度分析证明攻击图并行生成算法有效提高了攻击图的生成效率，降低了攻击图的复杂度。 - In attack graph area, this thesis proposes a kind of polynomial complexity and object-oriented approach to building attack graphs. This method aims at solving the attack graph construction problem in large-scale network environment.
在攻击图方面，本文提出一种面向对象的攻击图构建方法，以解决大规模网络环境下的攻击图构建问题。 - Moreover, the computational complexity of graph isomorphism makes it considerable theoretical important in mathematics.
而且，图同构问题的计算复杂性一直是数学领域研究的热点问题。 - Considering the usual graph cannot meet the demand of the ample features attributes and complexity of the road network, there appear node-link model and pseudo-dual graph model.
考虑到道路网的丰富特征、属性和复杂性（如道路的转弯限制等交通约束），常规图模型已不能满足要求。因此，出现了结点连接模型和伪二重图模型。 - Couple between classes expressed by couple graph and couple complexity is reflected by edge between vertex of couple graph and couple degree.
类之间的耦合性可以通过耦合图表示，耦合复杂性可以通过耦合图中顶点间边的数量和耦合程度表示。 - Its timing complexity is O ( m~ 2), which m is the number of edges in the network graph, faster than the GN algorithm and its variants, and suitable to the large-scale complex network clustering.
该方法的算法复杂度为O（m~2），其中m为网络图的边数，聚类速度明显优于同类GN算法和基于GN算法的一些变种算法，适用于大型复杂网络的快速聚类。